A Novel Apheresis Scheduling Approach to Increase Facility Throughput
نویسندگان
چکیده
منابع مشابه
A Joint Routing-Scheduling Approach for Throughput Optimization in WMNs
Wireless Mesh Networking is a promising proposal for broadband data transmission in a large area with low cost and acceptable QoS. These features’ trade offs in WMNs is a hot research field nowadays. In this paper a mathematical optimization framework has been developed to maximize throughput according to upper bound delay constraints. IEEE 802.11 based infrastructure backhauling mode of WMNs h...
متن کاملA Novel Optimization Approach Applied to Multi-Pass Turning Process
Optimization of turning process is a non-linear optimization with constrains and it is difficult for the conventional optimization algorithms to solve this problem. The purpose of present study is to demonstrate the potential of Imperialist Competitive Algorithm (ICA) for optimization of multipass turning process. This algorithm is inspired by competition mechanism among imperialists and coloni...
متن کاملA Novel Approach to Multiagent based Scheduling for Multicore Architecture
In a Multicore architecture, each package consists of large number of processors. This increase in processor core brings new evolution in parallel computing. Besides enormous performance enhancement, this multicore package injects lot of challenges and opportunities on the operating system scheduling point of view. We know that multiagent system is concerned with the development and analysis of...
متن کاملA Novel Approach to Aggregate Scheduling in Project-Oriented Manufacturing
In this paper we address medium-term scheduling in project oriented manufacturing systems. These systems may execute hundreds of thousands of manufacturing operations under various capacity and technological constraints within the typical 3-6 months long horizon. This challenges any branch of operation research or artificial intelligence. We suggest an aggregate scheduling approach to cope with...
متن کاملA Novel Bee Colony Approach to Distributed Systems Scheduling
The problem of task scheduling in distributed systems is known as an NP-hard problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The scheduling problem is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of dis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biology of Blood and Marrow Transplantation
سال: 2012
ISSN: 1083-8791
DOI: 10.1016/j.bbmt.2011.12.484